P 6= NP for all infinite Boolean rings
نویسنده
چکیده
We prove that all infinite Boolean rings (algebras) have the property P 6= NP according to the digital (binary) nondeterminism. A.M.S. Classification: 06E99, 03B70.
منابع مشابه
Dichotomy Theorems for Alternation-Bounded Quantified Boolean Formulas
In 1978, Schaefer proved his famous dichotomy theorem for generalized satisfiability problems. He defined an infinite number of propositional satisfiability problems, showed that all these problems are either in P or NP-complete, and gave a simple criterion to determine which of the two cases holds. This result is surprising in light of Ladner’s theorem, which implies that there are an infinite...
متن کاملRings with a setwise polynomial-like condition
Let $R$ be an infinite ring. Here we prove that if $0_R$ belongs to ${x_1x_2cdots x_n ;|; x_1,x_2,dots,x_nin X}$ for every infinite subset $X$ of $R$, then $R$ satisfies the polynomial identity $x^n=0$. Also we prove that if $0_R$ belongs to ${x_1x_2cdots x_n-x_{n+1} ;|; x_1,x_2,dots,x_n,x_{n+1}in X}$ for every infinite subset $X$ of $R$, then $x^n=x$ for all $xin R$.
متن کاملOmega-almost Boolean rings
In this paper the concept of an $Omega$- Almost Boolean ring is introduced and illistrated how a sheaf of algebras can be constructed from an $Omega$- Almost Boolean ring over a locally Boolean space.
متن کاملBounded Queries to SAT and the
We study the complexity of decision problems that can be solved by a polynomial-time Turing machine that makes a bounded number of queries to an NP oracle. Depending on whether we allow some queries to depend on the results of other queries, we obtain two (probably) diierent hierarchies. We present several results relating the bounded NP query hierarchies to each other and to the Boolean hierar...
متن کاملOn truth-table reducibility to SAT and the difference hierarchy over NP
We show that polynomial time truth-table reducibility via Boolean circuits to SAT is the same as log space truth-table reducibility via Boolean formulas to SAT and the same as log space Turing reducibility to SAT. In addition, we prove that a constant number of rounds of parallel queries to SAT is equivalent to one round of parallel queries. Finally, we show that the infinite difference hierarc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011